Preemptive Multitasking on FPGAs

نویسندگان

  • L. Levinson
  • Reinhard Männer
  • M. Sessler
  • Harald Simmler
چکیده

In exploring the efficacy of reconfigurable computing, one of the dimensions is the possibility for multitasking on an FPGA-based processor. Conventional computers and operating systems have demonstrated the many advantages of sharing computational hardware by several tasks over time. The ability to do run-time configuration and readback of FPGAs in a coprocessor architecture enables exploring the problems of implementing realistic multitasking.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Non-preemptive Multitasking on FPGAs: Task Placement and Footprint Transform

Partial reconfiguration allows for mapping and executing several tasks on an FPGA during runtime. Multitasking on FPGAs rises a number of questions on the management of the reconfigurable resource, which leads to concepts of reconfigurable operating systems. This paper focuses on a major aspect of a reconfigurable operating system: task placement and transformation. We first discuss task charac...

متن کامل

Memory Management to Support Multitasking on FPGA Based Systems

This work targets platforms, which consist beside memory and peripheral devices of FPGAs as the only computational resource. Applications running on such a platform are implemented as circuits also called hardware tasks. We introduce a memory management unit (MMU), which allows multiple tasks to concurrently use external RAMbanks. Moreover, the tasks can use the MMU to store their state before ...

متن کامل

Preemptive Hardware Multitasking in ReconOS

Preemptive hardware multitasking is not supported in most reconfigurable systems-on-chip (rSoCs), which severely limits the scope of hardware scheduling techniques on these platforms. While modern field-programmable gate arrays (FPGAs) support dynamic partial reconfiguration of any region at any time, most hardware tasks cannot be preempted at arbitrary points in time, because context saving an...

متن کامل

Speeding up Online Placement for XILINX FPGAs by Reducing Configuration Overhead

Recent generations of FPGAs allow run-time partial reconfiguration. To increase the efficacy of reconfigurable computing, multitasking on FPGAs is proposed. One of the challenging problems in multitasking systems is online template placement. In this paper, we describe how existing algorithms work, and propose a new multi-stage method for mapping of tasks to reconfigurable hardware. Also a new ...

متن کامل

Object-oriented simulation of preemptive feedback process schedulers

Based on recent research, very simple discrete-time control structures can be used to synthesise preemptive process schedulers for multitasking systems within a rigorous system-theoretical formalism. Doing so virtually eliminates any heuristics, and allows for a methodologically grounded analysis and assessment of the achieved performances. This paper introduces a Modelica library for the above...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000